Knygos.lt nariams
93,51 €
-30%
Įprastai
133,59 €
Computational Complexity
Knygos.lt nariams
93,51 €
-30%
Įprastai
133,59 €
- Išsiųsime per 10–14 d.d.
Describes recent achievements and classical results of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation. It can be used as a reference, for self-study, or as a beginning graduate textbook. More than 300 exercises are included.
/https://libri-media.knygos-static.lt/501562aa-2f35-469d-8003-729ce828459b/5)
- Autorius: Sanjeev Arora, Boaz Barak
- Leidėjas: Cambridge University Pr.
- Metai: 2009
- ISBN-10: 0521424267
- ISBN-13: 9780521424264
- Formatas: 18.4 x 26.5 x 4 cm, kieti viršeliai
- Kalba: Anglų
Atsiliepimai
Aprašymas
Describes recent achievements and classical results of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation. It can be used as a reference, for self-study, or as a beginning graduate textbook. More than 300 exercises are included.
Knygos.lt nariams
93,51 €
-30%
Įprastai
133,59 €
Išsiųsime per 10–14 d.d.
- Autorius: Sanjeev Arora, Boaz Barak
- Leidėjas: Cambridge University Pr.
- Metai: 2009
- ISBN-10: 0521424267
- ISBN-13: 9780521424264
- Formatas: 18.4 x 26.5 x 4 cm, kieti viršeliai
- Kalba: Anglų
Describes recent achievements and classical results of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation. It can be used as a reference, for self-study, or as a beginning graduate textbook. More than 300 exercises are included.
Atsiliepimai